708 . Vertex Minimal Planar Cyclic Graphs *
نویسندگان
چکیده
Let c (k) (c. (k» be the least number of vertices of a planar (planar connected) graph whose automorphism group is the cyclic group of order k. If k r is odd and if k = PIal. . . p,ar, PI' . . . ,Pr being primes then c (k) = 3 2: Piai and i=l c. (k) ~ c (k) for r ~ 1 while c. (k) = c (k) + 1 for r> 1. It is conjectured that a similar result holds for k even.
منابع مشابه
Recognizing IC-Planar and NIC-Planar Graphs
We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of crossing edges share at most one vertex. In a triangulated drawing each face is a triangle. I...
متن کاملAngewandte Mathematik Und Informatik Universit at Zu K Oln Minimal Elimination of Planar Graphs
We prove that the problem to get an inclusion minimal elimination ordering can be solved in linear time for planar graphs. The basic structure of the linear time algorithm is as follows. We select a vertex r as maximum and get a rst approximation of a minimal elimination ordering considering a vertex x as smaller than y if x has a larger distance than y from r. Using planarity, one can determin...
متن کاملObstruction Sets for Outer-Projective-Planar Graphs
A graph G is outer projective planar if it can be embedded in the projective plane so that every vertex appears on the boundary of a single face We exhibit obstruction sets for outer projective planar graphs with respect to the subdivision minor and Y orderings Equivalently we nd the minimal non outer projective planar graphs under these orderings
متن کاملDrawing Outer 1-planar Graphs with Few Slopes
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees. We show that an outer 1-planar graph G of bounded degree ∆ admits an outer 1-planar straight-line drawing that uses O(∆) different slopes, which gen...
متن کاملUpper Domination: Complexity and Approximation
We consider Upper Domination, the problem of finding a maximum cardinality minimal dominating set in a graph. We show that this problem does not admit an n1− approximation for any > 0, making it significantly harder than Dominating Set, while it remains hard even on severely restricted special cases, such as cubic graphs (APXhard), and planar subcubic graphs (NP-hard). We complement our negativ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005